2,566 research outputs found

    The end of HIV: Still a very long way to go, but progress continues.

    Get PDF
    In an Editorial accompanying PLOS Medicine's Special Issue on Advances in Prevention, Treatment and Cure of HIV/AIDS, Guest Editors Steven Deeks, Sharon Lewin, and Linda-Gail Bekker discuss priorities in the field and the content of the issue

    Finite-buffer queues with workload-dependent service and arrival rates

    Get PDF

    On an equivalence between loss rates and cycle maxima in queues and dams

    Get PDF

    An M/G/1 queue with adaptable service speed

    Get PDF

    A L\'evy input fluid queue with input and workload regulation

    Full text link
    We consider a queuing model with the workload evolving between consecutive i.i.d.\ exponential timers {eq(i)}i=1,2,...\{e_q^{(i)}\}_{i=1,2,...} according to a spectrally positive L\'evy process Yi(t)Y_i(t) that is reflected at zero, and where the environment ii equals 0 or 1. When the exponential clock eq(i)e_q^{(i)} ends, the workload, as well as the L\'evy input process, are modified; this modification may depend on the current value of the workload, the maximum and the minimum workload observed during the previous cycle, and the environment ii of the L\'evy input process itself during the previous cycle. We analyse the steady-state workload distribution for this model. The main theme of the analysis is the systematic application of non-trivial functionals, derived within the framework of fluctuation theory of L\'evy processes, to workload and queuing models

    Queues with delays in two-state strategies and Lévy input

    Get PDF
    We consider a reflected Lévy process without negative jumps, starting at the origin. When the reflected process first upcrosses level K, a timer is activated. After D time units, the timer expires and the Lévy exponent of the Lévy process is changed. As soon as the process hits zero again, the Lévy exponent reverses to the original function. If the process has reached the origin before the timer expires then the Lévy exponent does not change. Using martingale techniques, we analyze the steady-state distribution of the resulting process, reflected at the origin. We pay special attention to the cases of deterministic and exponential timers, and to the following three special Lévy processes: (i) a compound Poisson process plus negative drift (corresponding to an M/G/1 queue), (ii) Brownian motion, and (iii) a Lévy process that is a subordinator until the timer expires. © Applied Probability Trust 2008

    A fluid model for a relay node in an ad-hoc network: the case of heavy-tailed input

    Get PDF
    Relay nodes in an ad-hoc network can be modelled as fluid queues, in which the available service capacity is shared by the input and output. In this paper such a relay node is considered; jobs arrive according to a Poisson process and bring along a random amount of work. The total transmission capacity is fairly shared, meaning that, when n jobs are present, each job transmits traffic into the queue at rate 1/(n+1) while the queue is drained at the same rate of 1/(n + 1). Where previous studies mainly concentrated on the case of exponentially distributed job sizes, the present paper addresses regularly varying jobs. The focus lies on the tail asymptotics of the sojourn time S. Using sample-path arguments, it is proven that P {S > x} behaves roughly as the residual job size, i.e., if the job sizes are regularly varying of index –v, the tail of S is regularly varying of index 1 – v. In addition, we address the tail asymptotics of other performance metrics, such as the workload in the queue, the flow transfer time and the queueing delay
    • …
    corecore